A S E V Enteenth-order Polylogarithm Ladder A)
نویسندگان
چکیده
Cohen, Lewin and Zagier found four ladders that entail the polylogarithms Lin( k 1 ) := P r>0 kr 1 =r n at order n = 16, with indices k 360, and 1 being the smallest known Salem number, i.e. the larger real root of Lehmer's celebrated polynomial 10 + 9 7 6 5 4 3 + + 1, with the smallest known non-trivial Mahler measure. By adjoining the index k = 630, we generate a fth ladder at order 16 and a ladder at order 17 that we presume to be unique. This empirical integer relation, between elements of fLi17( k 1 ) j 0 k 630g and f (log 1) 2j j 0 j 8g, entails 125 constants, multiplied by integers with nearly 300 digits. It has been checked to more than 59,000 decimal digits. Among the ladders that we found in other number elds, the longest has order 13 and index 294. It is based on 10 6 5 4 + 1, which gives the sole Salem number < 1:3 with degree d < 12 for which 1=2 + 1=2 fails to be the largest eigenvalue of the adjacency matrix of a graph. ) This work was supported by the Director, O ce of Computational and Technology Research, Division of Mathematical, Information, and Computational Sciences of the U.S. Department of Energy, under contract number DE-AC03-76SF00098. b) Lawrence Berkeley Laboratory, MS 50B-2239, Berkeley, CA 94720, USA [email protected] ) Open University, Department of Physics, Milton Keynes MK7 6AA, UK [email protected]
منابع مشابه
Further results on total mean cordial labeling of graphs
A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...
متن کاملFurther results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملA seventeenth-order polylogarithm ladder
Cohen, Lewin and Zagier found four ladders that entail the polylogarithms Lin(α −k 1 ) := ∑ r>0 α −kr 1 /r n at order n = 16, with indices k ≤ 360, and α1 being the smallest known Salem number, i.e. the larger real root of Lehmer’s celebrated polynomial α + α − α − α − α − α − α + α + 1, with the smallest known non-trivial Mahler measure. By adjoining the index k = 630, we generate a fifth ladd...
متن کاملField-controlled magnetic order in the quantum spin-ladder system (Hpip)2CuBr4
Neutron diffraction is used to investigate the field-induced, antiferromagnetically ordered state in the two-leg spin-ladder material (Hpip)2CuBr4. This “classical” phase, a consequence of weak interladder coupling, is nevertheless highly unconventional: its properties are influenced strongly by the spin Luttinger-liquid state of the ladder subunits. We determine directly the order parameter (t...
متن کامل